Segmentation by Minimum Length Encoding
نویسندگان
چکیده
A digitized waveform is approximated by segments whose total description length is minimal for a given error bound. This approximation can be computed efficiently, and can be used for segmentation. The method is also shown to be applicable for segmentation and edge detection in gray level and range images.
منابع مشابه
Natural Image Segmentation with Adaptive Texture and Boundary Encoding
We present a novel algorithm for unsupervised segmentation of natural images that harnesses the principle of minimum description length (MDL). Our method is based on observations that a homogeneously textured region of a natural image can be well modeled by a Gaussian distribution and the region boundary can be effectively coded by an adaptive chain code. The optimal segmentation of an image is...
متن کاملPart{based Decomposition from Edge Images: Human Responses vs. Mdl Segmentation
This paper is concerned with an aspect of the structural properties of images of simple objects, namely their decomposition into generic parts using edge information only. In particular, it reports results of a psychological experiment conducted using experimentally naive subjects to assess their concept of part when presented with poor edge images. It compares the results with those of a recen...
متن کاملDeformable Model for Image Segmentation
This paper presents an approach for image segmentation using Minimum Description Length (MDL) principle and integrating region growing, region boundary fitting, model selection in an integrated manner, on which the final result is a kind of compromise of various sources of knowledge such as the original grey level image and deformable object models. The deformable model is a closed polygon depi...
متن کاملAdaptive Segmentation with Optimal Window Length Scheme using Fractal Dimension and Wavelet Transform
In many signal processing applications, such as EEG analysis, the non-stationary signal is often required to be segmented into small epochs. This is accomplished by drawing the boundaries of signal at time instances where its statistical characteristics, such as amplitude and/or frequency, change. In the proposed method, the original signal is initially decomposed into signals with different fr...
متن کاملClustering Association Rules
We consider the problem of clustering two-dimensional association rules in large databases. We present a geometricbased algorithm, BitOp, for performing the clustering, embedded within an association rule clustering system, ARCS. Association rule clustering is useful when the user desires to segment the data. We measure the quality of the segmentation generated by ARCS using the Minimum Descrip...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004